/* Defines:The following "Defines" are possible:
 * - DREG=register (default: Not defined) As an approximation to what an average C programmer might do, the "register" storage class is applied
 *   (if enabled by -DREG=register)
 *   - for local variables, if they are used (dynamically) five or more times
 *   - for parameters if they are used (dynamically) six or more times Note that an optimal "register" strategy is compiler-dependent, and that
 *     "register" declarations do not necessarily lead to faster execution.
 * - DNOSTRUCTASSIGN (default: Not defined) Define if the C compiler does not support assignment of structures.
 * - DNOENUMS (default: Not defined) Define if the C compiler does not support enumeration types.
 * - DTIMES                 (default)
 *   - DTIME The "times" function of UNIX (returning process times) or the "time" function (returning wallclock time) is used for measurement. 
 *     For single user machines, "time ()" is adequate. For multi-user machines where you cannot get single-user access, use the "times ()" 
 *     function. If you have neither, use a stopwatch in the dead of night. "printf"s are provided marking the points "Start Timer" and "Stop
 *     Timer". DO NOT use the UNIX "time(1)" command, as this will measure the total time to run this program, which will (erroneously) include
 *     the time to allocate storage (malloc) and to perform the initialization.
 * -DHZ=nnn In Berkeley UNIX, the function "times" returns process time in 1/HZ seconds, with HZ = 60 for most systems.
 *  CHECK YOUR SYSTEM DESCRIPTION BEFORE YOU JUST APPLY A VALUE.
 ***************************************************************************
 *  Compilation model and measurement (IMPORTANT):
 *  This C version of Dhrystone consists of three files:
 *  - dhry.h (this file, containing global definitions and comments)
 *  - dhry_1.c (containing the code corresponding to Ada package Pack_1)
 *  - dhry_2.c (containing the code corresponding to Ada package Pack_2)
 *  The following "ground rules" apply for measurements:
 *  - Separate compilation
 *  - No procedure merging
 *  - Otherwise, compiler optimizations are allowed but should be indicated
 *  - Default results are those without register declarations See the companion paper "Rationale for Dhrystone Version 2" for a more detailed
 *  discussion of these ground rules.
 *  For 16-Bit processors (e.g. 80186, 80286), times for all compilation models ("small", "medium", "large" etc.) should be given if possible,
 *  together with a definition of these models for the compiler system used.
 *
 **************************************************************************
 *  Dhrystone (C version) statistics:
 *  [Comment from the first distribution, updated for version 2.Note that because of language differences, the numbers are slightly different
 *   from the Ada version.]
 *  The following program contains statements of a high level programming language (here: C) in a distribution considered representative:           
 *    assignments                  52 (51.0 %)
 *    control statements           33 (32.4 %)
 *    procedure, function calls    17 (16.7 %)
 *  103 statements are dynamically executed. The program is balanced with respect to the three aspects:                                             
 *    - statement type
 *    - operand type
 *    - operand locality operand global, local, parameter, or constant.                     
 *  The combination of these three aspects is balanced only approximately.    
 *  1. Statement Type:                                                        
 *  -----------------             number
 *     V1 = V2                     9
 *       (incl. V1 = F(..)
 *     V = Constant               12
 *     Assignment,                 7
 *       with array element
 *     Assignment,                 6
 *       with record component
 *                                --
 *                                34       34
 *
 *     X = Y +|-|"&&"|"|" Z        5
 *     X = Y +|-|"==" Constant     6
 *     X = X +|- 1                 3
 *     X = Y *|/ Z                 2
 *     X = Expression,             1
 *           two operators
 *     X = Expression,             1
 *           three operators
 *                                --
 *                                18       18
 *
 *     if ....                    14
 *       with "else"      7
 *       without "else"   7
 *           executed        3
 *           not executed    4
 *     for ...                     7  |  counted every time
 *     while ...                   4  |  the loop condition
 *     do ... while                1  |  is evaluated
 *     switch ...                  1
 *     break                       1
 *     declaration with            1
 *       initialization
 *                                --
 *                                34       34
 *
 *     P (...)  procedure call    11
 *       user procedure      10
 *       library procedure    1
 *     X = F (...)
 *             function  call      6
 *       user function        5                                         
 *       library function     1                                               
 *                                --                                          
 *                                17       17
 *                                        ---
 *                                        103
 *    The average number of parameters in procedure or function calls is 1.82 (not counting the function values as implicit parameters).
 *  2. Operators
 *  ------------
 *                          number    approximate percentage
 *    Arithmetic             32          50.8                                 
 *       +                     21          33.3                              
 *       -                      7          11.1                              
 *       *                      3           4.8
 *       / (int div)            1           1.6
 *    Comparison             27          42.8
 *       ==                     9           14.3
 *       /=                     4            6.3
 *       >                      1            1.6
 *       <                      3            4.8
 *       >=                     1            1.6
 *       <=                     9           14.3
 *
 *    Logic                   4           6.3
 *
 *       && (AND-THEN)          1            1.6
 *       |  (OR)                1            1.6
 *       !  (NOT)               2            3.2
 *                           --          -----
 *                           63          100.1
 *  3. Operand Type (counted once per operand reference):
 *  ---------------
 *                          number    approximate percentage
 *     Integer               175        72.3 %
 *     Character              45        18.6 %
 *     Pointer                12         5.0 %
 *     String30                6         2.5 %
 *     Array                   2         0.8 %
 *     Record                  2         0.8 %
 *                           ---       -------
 *                           242       100.0 %
 *
 *  When there is an access path leading to the final operand (e.g. a record component), only the final data type on the access path is counted.       
 *  4. Operand Locality:                                                      
 *  -------------------
 *                                number    approximate percentage
 *     local variable              114        47.1 %
 *     global variable              22         9.1 %
 *     parameter                    45        18.6 %
 *        value                        23         9.5 %
 *        reference                    22         9.1 %
 *     function result               6         2.5 %
 *     constant                     55        22.7 %
 *                                 ---       -------
 *                                 242       100.0 %
 *
 *
 *  The program does not compute anything meaningful, but it is syntactically
 *  and semantically correct. All variables have a value assigned to them
 *  before they are used as a source operand.
 *
 *  There has been no explicit effort to account for the effects of a
 *  cache, or to balance the use of long or short displacements for code or
 *  data.
 *
 ***************************************************************************
 */


/* Compiler and system dependent definitions: */

#ifndef TIME
#define TIMES
#endif
                /* Use times(2) time function unless    */
                /* explicitly defined otherwise         */

#ifdef TIMES
#include <sys/types.h>
#include <sys/times.h>
                /* for "times" */
#endif

#define Mic_secs_Per_Second     1000000.0
                /* Berkeley UNIX C returns process times in seconds/HZ */

#ifdef  NOSTRUCTASSIGN
#define structassign(d, s)      memcpy(&(d), &(s), sizeof(d))
#else
#define structassign(d, s)      d = s
#endif

#ifdef  NOENUM
#define Ident_1 0
#define Ident_2 1
#define Ident_3 2
#define Ident_4 3
#define Ident_5 4
  typedef int   Enumeration;
#else
  typedef       enum    {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5}
                Enumeration;
#endif
        /* for boolean and enumeration types in Ada, Pascal */

/* General definitions: */

#include <stdio.h>
                /* for strcpy, strcmp */

#define Null 0 
                /* Value of a Null pointer */
#define true  1
#define false 0

typedef int     One_Thirty;
typedef int     One_Fifty;
typedef char    Capital_Letter;
typedef int     Boolean;
typedef char    Str_30 [31];
typedef int     Arr_1_Dim [50];
typedef int     Arr_2_Dim [50] [50];

/* 91B */
typedef struct record 
{
    struct record *Ptr_Comp; /*8B*/
    Enumeration    Discr; /*4B*/
    union {
          struct {
                  Enumeration Enum_Comp;
                  int         Int_Comp;
                  char        Str_Comp [31];
                  } var_1; /*39B*/
          struct {
                  Enumeration E_Comp_2;
                  char        Str_2_Comp [31];
                  } var_2;
          struct {
                  char        Ch_1_Comp;
                  char        Ch_2_Comp;
                  } var_3;
          } variant;
} Rec_Type, *Rec_Pointer;

